The Use of Simulated Annealing and Genetic Algorithms for a Multi-mode Resource-constrained Project Scheduling Problem with Discounted Cash Flows
نویسندگان
چکیده
This paper presents a multi-mode resource-constrained project scheduling problem (MRCPSP) with maximizing the net present value (NPV) form the project contractor’s point of view. Positive and negative cash flows are considered in this model. Furthermore, to make the model close to the real situations, four different models for positive cash flows are considered. Two meta-heuristics, called simulated annealing and genetic algorithms, are used in order to solve the proposed model of the forgoing problem. To schedule all activities, a bi-directional scheduling generation scheme (SGS) for the multi-mode version is proposed, and the activity list structure selects for presenting a permutation of activities. Finally, computational results for a set of test problems taken from the project scheduling problem library (PSPLIB) are presented and discussed.
منابع مشابه
A New Bi-Objective Model for a Multi-Mode Resource-Constrained Project Scheduling Problem with Discounted Cash Flows and four Payment Models
The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...
متن کاملA Preemptive multimode resource constrained project scheduling model with cash flows
Resource constrained project scheduling problem is one of the most important issues in project planning and management. The objective function of this problem is to minimize the completion time of a project. When there is budget constraint or high risk for investment, using the criteria such as cash flows is so important. The development of computer systems and processors makes it possible to t...
متن کاملOptimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms
The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...
متن کاملبکارگیری الگوریتمهای ژنتیک و شبیهسازی تبرید برای حل مساله زمانبندی پروژه با محدودیت منابع در حالت چند مد و با جریانهای نقدی تنزیل یافته (گزارش فنی)
This paper presents a multi-mode resource-constrained project scheduling problem (MRCPSP) with maximizing the net present value (NPV) form the project contractor’s point of view. Positive and negative cash flows are considered in this model. Furthermore, to make the model close to the real situations, four different models for positive cash flows are considered. Two meta-heuristics, called simu...
متن کاملA Bi-objective Pre-emption Multi-mode Resource Constrained Project Scheduling Problem with due Dates in the Activities
In this paper, a novel mathematical model for a preemption multi-mode multi-objective resource-constrained project scheduling problem with distinct due dates and positive and negative cash flows is presented. Although optimization of bi-objective problems with due dates is an essential feature of real projects, little effort has been made in studying the P-MMRCPSP while due dates are included i...
متن کامل